105 research outputs found

    Knowledge structure, knowledge granulation and knowledge distance in a knowledge base

    Get PDF
    AbstractOne of the strengths of rough set theory is the fact that an unknown target concept can be approximately characterized by existing knowledge structures in a knowledge base. Knowledge structures in knowledge bases have two categories: complete and incomplete. In this paper, through uniformly expressing these two kinds of knowledge structures, we first address four operators on a knowledge base, which are adequate for generating new knowledge structures through using known knowledge structures. Then, an axiom definition of knowledge granulation in knowledge bases is presented, under which some existing knowledge granulations become its special forms. Finally, we introduce the concept of a knowledge distance for calculating the difference between two knowledge structures in the same knowledge base. Noting that the knowledge distance satisfies the three properties of a distance space on all knowledge structures induced by a given universe. These results will be very helpful for knowledge discovery from knowledge bases and significant for establishing a framework of granular computing in knowledge bases

    Towards Privacy-Aware Causal Structure Learning in Federated Setting

    Full text link
    Causal structure learning has been extensively studied and widely used in machine learning and various applications. To achieve an ideal performance, existing causal structure learning algorithms often need to centralize a large amount of data from multiple data sources. However, in the privacy-preserving setting, it is impossible to centralize data from all sources and put them together as a single dataset. To preserve data privacy, federated learning as a new learning paradigm has attracted much attention in machine learning in recent years. In this paper, we study a privacy-aware causal structure learning problem in the federated setting and propose a novel Federated PC (FedPC) algorithm with two new strategies for preserving data privacy without centralizing data. Specifically, we first propose a novel layer-wise aggregation strategy for a seamless adaptation of the PC algorithm into the federated learning paradigm for federated skeleton learning, then we design an effective strategy for learning consistent separation sets for federated edge orientation. The extensive experiments validate that FedPC is effective for causal structure learning in a federated learning setting.Comment: This paper has been accepted by the journal IEEE Transactions on Big Data, and it contains 21 pages, 9 figures and 15 table

    DualTable: A Hybrid Storage Model for Update Optimization in Hive

    Full text link
    Hive is the most mature and prevalent data warehouse tool providing SQL-like interface in the Hadoop ecosystem. It is successfully used in many Internet companies and shows its value for big data processing in traditional industries. However, enterprise big data processing systems as in Smart Grid applications usually require complicated business logics and involve many data manipulation operations like updates and deletes. Hive cannot offer sufficient support for these while preserving high query performance. Hive using the Hadoop Distributed File System (HDFS) for storage cannot implement data manipulation efficiently and Hive on HBase suffers from poor query performance even though it can support faster data manipulation.There is a project based on Hive issue Hive-5317 to support update operations, but it has not been finished in Hive's latest version. Since this ACID compliant extension adopts same data storage format on HDFS, the update performance problem is not solved. In this paper, we propose a hybrid storage model called DualTable, which combines the efficient streaming reads of HDFS and the random write capability of HBase. Hive on DualTable provides better data manipulation support and preserves query performance at the same time. Experiments on a TPC-H data set and on a real smart grid data set show that Hive on DualTable is up to 10 times faster than Hive when executing update and delete operations.Comment: accepted by industry session of ICDE201

    CRL4 antagonizes SCFFbxo7-mediated turnover of cereblon and BK channel to regulate learning and memory

    Get PDF
    Intellectual disability (ID), one of the most common human developmental disorders, can be caused by genetic mutations in Cullin 4B (Cul4B) and cereblon (CRBN). CRBN is a substrate receptor for the Cul4A/B-DDB1 ubiquitin ligase (CRL4) and can target voltage- and calcium-activated BK channel for ER retention. Here we report that ID-associated CRL4CRBNmutations abolish the interaction of the BK channel with CRL4, and redirect the BK channel to the SCFFbxo7ubiquitin ligase for proteasomal degradation. Glioma cell lines harbouring CRBN mutations record density-dependent decrease of BK currents, which can be restored by blocking Cullin ubiquitin ligase activity. Importantly, mice with neuron-specific deletion of DDB1 or CRBN express reduced BK protein levels in the brain, and exhibit similar impairment in learning and memory, a deficit that can be partially rescued by activating the BK channel. Our results reveal a competitive targeting of the BK channel by two ubiquitin ligases to achieve exquisite control of its stability, and support changes in neuronal excitability as a common pathogenic mechanism underlying CRL4CRBN–associated ID

    Global Carbon Budget 2021

    Get PDF
    • …
    corecore